- generalized queues
- Программирование: обобщённые очереди
Универсальный англо-русский словарь. Академик.ру. 2011.
generalized queues
Смотреть что такое "generalized queues" в других словарях:
Generalized Processor Sharing — (GPS)cite journal|first=A. K.|last=Parekh|coauthors=Gallager, R. G.|title=A Generalized Processor Sharing approach to Flow control in Integrated Services Networks: The Single Node Case|journal=Proceedings of IEEE Infocom|year=1992] was developed… … Wikipedia
IBM WebSphere MQ — is a family of network software products launched by IBM in March 1992. It was previously known as MQSeries, a trademark that IBM rebranded in 2002 to join the suite of WebSphere products. WebSphere MQ, which is often referred to simply as MQ by… … Wikipedia
FIFO — is an acronym for First In, First Out, an abstraction in ways of organizing and manipulation of data relative to time and prioritization. This expression describes the principle of a queue processing technique or servicing conflicting demands by… … Wikipedia
MMDF — MMDF, the Multichannel Memorandum Distribution Facility, is a mail transfer agent (MTA), a computer program designed to transmit e mail. It was originally developed at the University of Delaware in the late 1970s, and provided the initial means… … Wikipedia
Fair queuing — is a scheduling algorithm used in computer and telecommunications networks to allow multiple packet flows to fairly share the link capacity. The advantage over conventional first in first out (FIFO) queuing is that a high data rate flow,… … Wikipedia
DNIX — Company / developer Dataindustrier AB OS family Unix like Working state Historic Source model Closed source Latest stable release 5.4 … Wikipedia
Binary heap — Example of a complete binary max heap Example of a complete binary min heap A binary … Wikipedia
LIFO — is an acronym which stands for last in, first out. In computer science and queueing theory this refers to the way items stored in some types of data structures are processed. By definition, in a LIFO structured linear list, elements can only be… … Wikipedia
Container (data structure) — For the abstract notion of containers in Type theory, see Container (Type theory). In computer science, a container is a class, a data structure[1][2], or an abstract data type (ADT) whose instances are collections of other objects. In other… … Wikipedia
Min-max heap — A min max heap is a double ended priority queue implemented as a modified version of a binary heap. Like a binary heap, a min max heap is represented as a complete binary tree. Unlike a binary heap, though, the nodes in this tree do not obey the… … Wikipedia
Rete algorithm — The Rete algorithm is an efficient pattern matching algorithm for implementing production rule systems. The Rete algorithm was designed by Dr Charles L. Forgy of Carnegie Mellon University, first published in a working paper in 1974, and later… … Wikipedia
